Recoil growth algorithm for chain molecules with continuous interactions
نویسندگان
چکیده
منابع مشابه
Multicanonical chain-growth algorithm.
We present a temperature-independent Monte Carlo method for the determination of the density of states of lattice proteins that combines the fast ground-state search strategy of the new pruned-enriched Rosenbluth chain-growth method and multicanonical reweighting for sampling the complete energy space. Since the density of states contains all energetic information of a statistical system, we ca...
متن کاملEntropic recoil separation of long DNA molecules.
A novel technique that can rapidly separate long-strand polymers according to length is presented. The separation mechanism is mediated by a confinement-induced entropic force at the abrupt interface between regions of vastly different configuration entropy. To demonstrate this technique, DNA molecules were partially inserted into a dense array of nanopillars (an entropically unfavorable region...
متن کاملA Novel Continuous KNN Prediction Algorithm to Improve Manufacturing Policies in a VMI Supply Chain
This paper examines and compares various manufacturing policies which manufacturer may adopt so as to improve the performance of a vendor managed inventory (VMI) partnership. The goal is to maximize the combined cumulative profit of supply chain while minimizing relevant inventory management costs. The supply chain is a two-level system with a single manufacturer and single retailer at each lev...
متن کاملAn Improved Bat Algorithm with Grey Wolf Optimizer for Solving Continuous Optimization Problems
Metaheuristic algorithms are used to solve NP-hard optimization problems. These algorithms have two main components, i.e. exploration and exploitation, and try to strike a balance between exploration and exploitation to achieve the best possible near-optimal solution. The bat algorithm is one of the metaheuristic algorithms with poor exploration and exploitation. In this paper, exploration and ...
متن کاملA cross entropy algorithm for continuous covering location problem
Covering problem tries to locate the least number of facilities and each demand has at least one facility located within a specific distance.This paper considers a cross entropy algorithm for solving the mixed integer nonlinear programming (MINLP) for covering location model.The model is solved to determine the best covering value.Also, this paper proposes aCross Entropy (CE) algorithm consider...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Molecular Physics
سال: 1999
ISSN: 0026-8976,1362-3028
DOI: 10.1080/00268979909482926